package leetcode.code1000;

import java.util.Arrays;

import leetcode.IDebug;
import leetcode.helper.H;

public class Solution implements IDebug {

	public int mergeStones(int[] stones, int k) {
		int n = stones.length;
		int t = (n - 1) % (k - 1) + 1;
		if (t != 1) {
			return -1;
		}
		int[][] dp = new int[n][k];
		for (int i = 1; i <= n; i++) {

		}
		return dp[n - 1][1];
	}

	@Override
	public void debug4() {
		H.compare(20, this.mergeStones(H.str2array3("[3,2,4,1]"), 2));

	}

	@Override
	public void debug3() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug2() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug1() {
		// TODO Auto-generated method stub

	}

	public static void main(String[] args) {
		Solution so = new Solution();
		so.debug1();
		so.debug2();
		so.debug3();
		so.debug4();
		System.out.println(0x3f3f3f3f);
	}

}
